Cellular Resource-Driven Automata

Resource-driven automata (RDA) are finite automata, sitting in the nodes of a finite system net and asynchronously consuming/producing shared resources through input/output system ports (arcs of the system net). RDAs themselves may be resources for each other, thus allowing the highly flexible structure of the model. RDA-nets are expressively equivalent to Petri nets [2]. In this paper a new formalism of cellular RDAs is introduced – RDAnets having an infinite (but regular) system net. A hierarchy of classes is built using restrictions on the underlying grid (in the 1-dimensional case), the expressive power of several major classes is studied.